Wireless Communication

K. K. S. Harika ¹, P. Harini ², M. Kiran Kumar ³, K. Kondaiah ⁴

Affiliations
1 Computer Science and Engineering, Jawaharlal Nehru Technological University-JNTU University, Kakinada, IN
2 Electronics and Communications Engineering, University of Madras, Chennai, IN
3 Information Technology, Acharya Nagarjuna University, Guntur, IN
4 Computer Science and Engineering, University of Pune, IN

Abstract

In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally, the paper explores some implementation issues in the setting of 802.11 networks.

Full Text

     

Nagalatha Yannam ¹, S. Anil Kumar ², P. Harini ³

Affiliations
1 Information Technology from St. Ann's College of Engineering and Technology, Chirala, IN
2 Computer Science & Engineering from Siddhartha Engineering College, IN
3 Electronics and Communications Engineering from University of Madras, Chennai, IN

Abstract

Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. In this article, we consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate this traffic allocation as a lossy network flown optimization problem using portfolio selection theory from financial statistics. We show that in multi-source networks, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in network utility maximization (NUM). We demonstrate the network's ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, we simulate the achievable throughput using our proposed traffic allocation method in several scenarios.

Keywords

Jamming, Multiple Path Routing, Portfolio Selection Theory, Optimization, Network Utility Maximization.

Full Text